0.07/0.09	% Problem    : Vampire---4.8_4784 : TPTP v0.0.0. Released v0.0.0.
0.07/0.10	% Command    : run_E %s %d THM
0.09/0.30	% Computer : n007.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1440
0.09/0.30	% WCLimit    : 180
0.09/0.30	% DateTime   : Mon Jul  3 12:36:43 EDT 2023
0.09/0.30	% CPUTime    : 
0.15/0.40	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.5sdvldVDU8/Vampire---4.8_4784
0.15/0.40	# Version: 3.1pre001-ho
20.87/3.04	# Preprocessing class: HSMSSMSSSSSNHHA.
20.87/3.04	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
20.87/3.04	# Starting full_lambda_6 with 540s (3) cores
20.87/3.04	# Starting post_as_ho1 with 180s (1) cores
20.87/3.04	# Starting lpo6_lambda_fix with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_1 with 180s (1) cores
20.87/3.04	# Starting new_ho_10_unif with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_2 with 180s (1) cores
20.87/3.04	# ho_unfolding_2 with pid 4970 completed with status 0
20.87/3.04	# Result found by ho_unfolding_2
20.87/3.04	# Preprocessing class: HSMSSMSSSSSNHHA.
20.87/3.04	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
20.87/3.04	# Starting full_lambda_6 with 540s (3) cores
20.87/3.04	# Starting post_as_ho1 with 180s (1) cores
20.87/3.04	# Starting lpo6_lambda_fix with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_1 with 180s (1) cores
20.87/3.04	# Starting new_ho_10_unif with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_2 with 180s (1) cores
20.87/3.04	# No SInE strategy applied
20.87/3.04	# Search class: HGHNF-FFSF22-SHHFFSBN
20.87/3.04	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
20.87/3.04	# Starting new_ho_10_unif with 54s (1) cores
20.87/3.04	# new_ho_10_unif with pid 4978 completed with status 0
20.87/3.04	# Result found by new_ho_10_unif
20.87/3.04	# Preprocessing class: HSMSSMSSSSSNHHA.
20.87/3.04	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
20.87/3.04	# Starting full_lambda_6 with 540s (3) cores
20.87/3.04	# Starting post_as_ho1 with 180s (1) cores
20.87/3.04	# Starting lpo6_lambda_fix with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_1 with 180s (1) cores
20.87/3.04	# Starting new_ho_10_unif with 180s (1) cores
20.87/3.04	# Starting ho_unfolding_2 with 180s (1) cores
20.87/3.04	# No SInE strategy applied
20.87/3.04	# Search class: HGHNF-FFSF22-SHHFFSBN
20.87/3.04	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
20.87/3.04	# Starting new_ho_10_unif with 54s (1) cores
20.87/3.04	# Preprocessing time       : 0.001 s
20.87/3.04	# Presaturation interreduction done
20.87/3.04	
20.87/3.04	# Proof found!
20.87/3.04	# SZS status Theorem
20.87/3.04	# SZS output start CNFRefutation
20.87/3.04	thf(decl_22, type, epred1_0: a > a > $o).
20.87/3.04	thf(decl_23, type, esk1_0: (a > $o) > a).
20.87/3.04	thf(decl_24, type, esk2_2: (a > $o) > a > a).
20.87/3.04	thf(decl_25, type, esk3_0: a > a).
20.87/3.04	thf(cT145_DOUBLE, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((?[X3:a > $o]:((?[X4:a]:(((~((X1 @ (X2 @ X3) @ X4))|~((X1 @ (X2 @ X3) @ X4)))&![X5:a]:((~((X3 @ X5))|(X1 @ X5 @ X4)|(X1 @ X5 @ X4)|~((X3 @ X5))))))|?[X6:a]:(((~((X1 @ X6 @ (X2 @ X3)))|~((X1 @ X6 @ (X2 @ X3))))&((X3 @ X6)|(X3 @ X6))))))|![X7:a > a]:((?[X8:a, X9:a]:(((~((X1 @ (X7 @ X8) @ (X7 @ X9)))|~((X1 @ (X7 @ X8) @ (X7 @ X9))))&((X1 @ X8 @ X9)|(X1 @ X8 @ X9))))|?[X10:a]:((((X1 @ (X7 @ X10) @ X10)|(X1 @ (X7 @ X10) @ X10))&((X1 @ X10 @ (X7 @ X10))|(X1 @ X10 @ (X7 @ X10)))))))|?[X11:a, X12:a, X13:a]:((((~((X1 @ X11 @ X13))|~((X1 @ X11 @ X13)))&((X1 @ X12 @ X13)|(X1 @ X12 @ X13)))&((X1 @ X11 @ X12)|(X1 @ X11 @ X12)))))), file('/export/starexec/sandbox/tmp/tmp.5sdvldVDU8/Vampire---4.8_4784', cT145_DOUBLE)).
20.87/3.04	thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:((?[X3:a > $o]:((?[X4:a]:((~(X1 @ (X2 @ X3) @ X4)&![X5:a]:((~(X3 @ X5)|(X1 @ X5 @ X4)|(X1 @ X5 @ X4)|~(X3 @ X5)))))|?[X6:a]:((~(X1 @ X6 @ (X2 @ X3))&(X3 @ X6)))))|![X7:a > a]:((?[X8:a, X9:a]:((~(X1 @ (X7 @ X8) @ (X7 @ X9))&(X1 @ X8 @ X9)))|?[X10:a]:(((X1 @ (X7 @ X10) @ X10)&(X1 @ X10 @ (X7 @ X10))))))|?[X11:a, X12:a, X13:a]:(((~(X1 @ X11 @ X13)&(X1 @ X12 @ X13))&(X1 @ X11 @ X12)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cT145_DOUBLE])])).
20.87/3.04	thf(c_0_2, negated_conjecture, ![X29:a > $o, X30:a, X32:a, X34:a, X35:a, X36:a, X37:a, X38:a, X39:a]:(((((((((X29 @ (esk2_2 @ X29 @ X30))|(epred1_0 @ (esk1_0 @ X29) @ X30))&(~(epred1_0 @ (esk2_2 @ X29 @ X30) @ X30)|(epred1_0 @ (esk1_0 @ X29) @ X30)))&(~(epred1_0 @ (esk2_2 @ X29 @ X30) @ X30)|(epred1_0 @ (esk1_0 @ X29) @ X30)))&((X29 @ (esk2_2 @ X29 @ X30))|(epred1_0 @ (esk1_0 @ X29) @ X30)))&((epred1_0 @ X32 @ (esk1_0 @ X29))|~(X29 @ X32)))&(((epred1_0 @ (esk3_0 @ X34) @ (esk3_0 @ X35))|~(epred1_0 @ X34 @ X35))&(~(epred1_0 @ (esk3_0 @ X36) @ X36)|~(epred1_0 @ X36 @ (esk3_0 @ X36)))))&((epred1_0 @ X37 @ X39)|~(epred1_0 @ X38 @ X39)|~(epred1_0 @ X37 @ X38)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
20.87/3.04	thf(c_0_3, negated_conjecture, ![X4:a, X5:a, X6:a]:(((epred1_0 @ X4 @ X5)|~((epred1_0 @ X6 @ X5))|~((epred1_0 @ X4 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_4, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_5, negated_conjecture, ![X4:a, X6:a, X5:a]:(((epred1_0 @ X4 @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ (esk3_0 @ X6)))|~((epred1_0 @ X6 @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
20.87/3.04	thf(c_0_6, negated_conjecture, ![X3:a > $o, X4:a]:(((X3 @ (esk2_2 @ X3 @ X4))|(epred1_0 @ (esk1_0 @ X3) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_7, negated_conjecture, ![X3:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X3))|~((X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_8, negated_conjecture, ![X4:a, X20:a > a, X7:a > a, X5:a]:(((epred1_0 @ (X7 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X7 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X7 @ Z0) @ (esk3_0 @ (X20 @ Z0)))))) @ X4)|~((epred1_0 @ (X20 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X7 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
20.87/3.04	thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_6])).
20.87/3.04	thf(c_0_10, negated_conjecture, ![X3:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X3) @ X4)|~((epred1_0 @ (esk2_2 @ X3 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
20.87/3.04	thf(c_0_12, negated_conjecture, ![X7:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X7 @ Z0)))))))|~((epred1_0 @ X4 @ (X7 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])).
20.87/3.04	thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
20.87/3.04	thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
20.87/3.04	thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
20.87/3.04	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']).
20.87/3.04	# SZS output end CNFRefutation
20.87/3.04	# Parsed axioms                        : 2
20.87/3.04	# Removed by relevancy pruning/SinE    : 0
20.87/3.04	# Initial clauses                      : 9
20.87/3.04	# Removed in clause preprocessing      : 1
20.87/3.04	# Initial clauses in saturation        : 8
20.87/3.04	# Processed clauses                    : 769
20.87/3.04	# ...of these trivial                  : 117
20.87/3.04	# ...subsumed                          : 237
20.87/3.04	# ...remaining for further processing  : 415
20.87/3.04	# Other redundant clauses eliminated   : 0
20.87/3.04	# Clauses deleted for lack of memory   : 0
20.87/3.04	# Backward-subsumed                    : 28
20.87/3.04	# Backward-rewritten                   : 38
20.87/3.04	# Generated clauses                    : 39265
20.87/3.04	# ...of the previous two non-redundant : 33756
20.87/3.04	# ...aggressively subsumed             : 0
20.87/3.04	# Contextual simplify-reflections      : 0
20.87/3.04	# Paramodulations                      : 39103
20.87/3.04	# Factorizations                       : 161
20.87/3.04	# NegExts                              : 0
20.87/3.04	# Equation resolutions                 : 1
20.87/3.04	# Total rewrite steps                  : 5875
20.87/3.04	# Propositional unsat checks           : 0
20.87/3.04	#    Propositional check models        : 0
20.87/3.04	#    Propositional check unsatisfiable : 0
20.87/3.04	#    Propositional clauses             : 0
20.87/3.04	#    Propositional clauses after purity: 0
20.87/3.04	#    Propositional unsat core size     : 0
20.87/3.04	#    Propositional preprocessing time  : 0.000
20.87/3.04	#    Propositional encoding time       : 0.000
20.87/3.04	#    Propositional solver time         : 0.000
20.87/3.04	#    Success case prop preproc time    : 0.000
20.87/3.04	#    Success case prop encoding time   : 0.000
20.87/3.04	#    Success case prop solver time     : 0.000
20.87/3.04	# Current number of processed clauses  : 343
20.87/3.04	#    Positive orientable unit clauses  : 82
20.87/3.04	#    Positive unorientable unit clauses: 0
20.87/3.04	#    Negative unit clauses             : 14
20.87/3.04	#    Non-unit-clauses                  : 247
20.87/3.04	# Current number of unprocessed clauses: 32565
20.87/3.04	# ...number of literals in the above   : 100556
20.87/3.04	# Current number of archived formulas  : 0
20.87/3.04	# Current number of archived clauses   : 72
20.87/3.04	# Clause-clause subsumption calls (NU) : 10458
20.87/3.04	# Rec. Clause-clause subsumption calls : 8877
20.87/3.04	# Non-unit clause-clause subsumptions  : 260
20.87/3.04	# Unit Clause-clause subsumption calls : 2296
20.87/3.04	# Rewrite failures with RHS unbound    : 0
20.87/3.04	# BW rewrite match attempts            : 1698
20.87/3.04	# BW rewrite match successes           : 47
20.87/3.04	# Condensation attempts                : 769
20.87/3.04	# Condensation successes               : 9
20.87/3.04	# Termbank termtop insertions          : 10155079
20.87/3.04	
20.87/3.04	# -------------------------------------------------
20.87/3.04	# User time                : 2.536 s
20.87/3.04	# System time              : 0.100 s
20.87/3.04	# Total time               : 2.636 s
20.87/3.04	# Maximum resident set size: 1712 pages
20.87/3.05	
20.87/3.05	# -------------------------------------------------
20.87/3.05	# User time                : 2.536 s
20.87/3.05	# System time              : 0.102 s
20.87/3.05	# Total time               : 2.638 s
20.87/3.05	# Maximum resident set size: 1728 pages
20.87/3.05	% E---3.1 exiting
20.87/3.05	EOF